Preference-based belief revision for rule-based agents
نویسندگان
چکیده
منابع مشابه
Preference-based belief revision for rule-based agents
Agents which perform inferences on the basis of unreliable information need an ability to revise their beliefs if they discover an inconsistency. Such a belief revision algorithm ideally should be rational, should respect any preference ordering over the agent’s beliefs (removing less preferred beliefs where possible) and should be fast. However, while standard approaches to rational belief rev...
متن کاملBelief revision for rule-based agents
Agents which perform inferences on the basis of possibly unreliable information need an ability to revise their beliefs if they discover an inconsistency. However, most belief revision algorithms for classical reasoners have quite high complexity, which makes them unsuitable for resource-bounded reasoners. We consider belief revision for agents which reason in a simpler logic that the full firs...
متن کاملA Belief Revision Approach for Argumentation-Based Negotiation Agents
Negotiation is an interaction that happens in multi-agent systems when agents have conflicting objectives and must look for an acceptable agreement. A typical negotiating situation involves two agents that cannot reach their goals by themselves because they do not have some resources they need or they do not know how to use them to reach their goals. Therefore, they must start a negotiation dia...
متن کاملBelief Revision and Verisimilitude Based on Preference and Truth Orderings
In this rather technical paper we establish a useful combination of belief revision and verisimilitude according to which better theories provide better predictions, and revising with more verisimilar data results in theories that are closer to the truth. Moreover, this paper presents two alternative definitions of refined verisimilitude, which are more perspicuous than the algebraic version us...
متن کاملSampling-Based Belief Revision
Model sampling has proved to be a practically viable method for decision-making under uncertainty, for example in imperfect-information games with large state spaces. In this paper, we examine the logical foundations of sampling-based belief revision. We show that it satisfies six of the standard AGM postulates but not Vacuity nor Subexpansion. We provide a corresponding representation theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Synthese
سال: 2008
ISSN: 0039-7857,1573-0964
DOI: 10.1007/s11229-008-9364-0